Using Assumptions to Distribute Alternation Free μ-Calculus Model Checking
نویسندگان
چکیده
منابع مشابه
Using Assumptions to Distribute CTL Model Checking
In this work we discuss the problem of performing distributed CTL model checking by splitting the given state space into several “partial state spaces”. The partial state space is modelled as a Kripke structure with border states. Each computer involved in the distributed computation owns a partial state space and performs a model checking algorithm on this incomplete structure. To be able to p...
متن کاملLocal Parallel Model Checking for the Alternation-Free µ-Calculus
We describe the design of (several variants of) a local parallel model-checking algorithm for the alternation-free fragment of the -calculus. It exploits a characterisation of the problem for this fragment in terms of two-player games. For the corresponding winner, our algorithm determines in parallel a winning strategy, which may be employed for interactively debugging the underlying system, a...
متن کاملGlobal Caching for the Alternation-free μ-Calculus
We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-free μ-calculus. The algorithm supports global caching with intermediate propagation and runs in time 2O(n). In game-theoretic terms, our algorithm integrates the steps for constructing and solving the Büchi game arising from the input tableau into a single procedure; this is done onthe-fly, i.e. may ter...
متن کاملμ-Calculus Model Checking in Maude
In this paper, a rewrite theory for checking μ-calculus properties is developed. We use the same framework proposed in [EMS02] and demonstrate how rewriting logic can be used as a unified formalism from model specification to verification algorithm implementation. Furthermore, since μ-calculus is more expressive than LTL, this work can be seen as an extension to [EMS02] in theory. We also devel...
متن کاملEfficient on-the-fly model-checking for regular alternation-free mu-calculus
Model-checking is a successful technique for automatically verifying concurrent finite-state systems. When building a model-checker, a good compromise must be made between the expressive power of the property description formalism, the complexity of the model-checking problem, and the user-friendliness of the interface. We present a temporal logic and an associated model-checking method that at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80094-5